WEKO3
アイテム / Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees / Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND OR Trees 2002
Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND OR Trees 2002
ファイル | ライセンス |
---|---|
Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND OR Trees 2002.pdf (265.8 kB) sha256 df1b05ec5327f72756fa67fd5c0cc8b4e5f28027e1ee7126683fa2a92b1af480 |
公開日 | 2017-12-14 | |||||
---|---|---|---|---|---|---|
ファイル名 | Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND OR Trees 2002.pdf | |||||
本文URL | https://repository.dl.itc.u-tokyo.ac.jp/record/48966/files/Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND OR Trees 2002.pdf | |||||
ラベル | Proof for the Equivalence between Some Best-First Algorithms and Depth-First Algorithms for AND OR Trees 2002.pdf | |||||
フォーマット | application/pdf | |||||
サイズ | 265.8 kB |
Version | Date Modified | Object File Name | File Size | File Hash Value | Contributor Name | Show/Hide |
---|